Efficient Caching in Elimination Trees
نویسندگان
چکیده
In this paper, we present subcaching, a method for reducing the size of the caches in the recursive decomposition while maintaining the runtime of recursive conditioning with complete caching. We also demonstrate a heuristic for constructing recursive decompositions that improves the effects of subcaching, and show empirically that the savings in space is quite substantial, with very little effect on the runtime of recursive conditioning.
منابع مشابه
Elimination Structures in Scientific Computing
Tel-Aviv University 1.1 The elimination tree . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1-2 The elimination game • The elimination tree data structure • An algorithm • A skeleton graph • Supernodes 1.2 Applications of etrees . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1-8 Efficient symbolic factorization • Predicting row and column nonzero counts •...
متن کاملCQP-Miner: Mining Conserved XML Query Patterns For Evolution-Conscious Caching
Existing xml query pattern-based caching strategies focus on extracting the set of frequently issued query pattern trees (qpt) based on the support of the qpts in the history. These approaches ignore the evolutionary features of the qpts. In this paper, we propose a novel type of query pattern called conserved query paths (cqp) for efficient caching by integrating the support and evolutionary f...
متن کاملOn the Discovery of Conserved XML Query Patterns for Evolution-Conscious Caching
Existing xml query pattern-based caching strategies focus on extracting the set of frequently issued query pattern trees (qpt) based on the support of the qpts in the history. These approaches ignore the evolutionary features of the qpts. In this paper, we propose a novel type of query pattern called conserved query paths (cqp) for efficient caching by integrating the support and evolutionary f...
متن کاملEfficient Setup for Multicast Connections Using Tree-Caching
* Corresponding author. AbstractThe problem of finding a minimum-cast multicast tree ( Steiner tree) is known as NP-complete. Heuristic-based algorithms for this problem to achieve good performance are usually time-consuming. In this paper, we propose a new strategy called tree-caching for efficient setup of multicast connections in connection-oriented networks. In this scheme, the tree topolog...
متن کاملIn-Network Caching vs. Redundancy Elimination
Network-level Redundancy Elimination (RE) techniques have been proposed to reduce the amount of traffic in the Internet. and the costs of the WAN access in the Internet. RE middleboxes are usually placed in the network access gateways and strip off the repeated data from the packets. More recently, generic network-level caching architectures have been proposed as alternative to reduce the redun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007